Planning-Interval Duration in Labor-Shift Scheduling
نویسندگان
چکیده
منابع مشابه
Iran’s Shift in Family Planning Policies: Concerns and Challenges
Iran’s significant success in implementing Family Planning (FP) during the past 25 years, has made it a role model in the world. The Total Fertility Rate (TFR) in Iran has dropped from 6.5 in 1960 to 1.6 in 2012, which is well below the targeted value of 2.2 for the country. Iran’s success story, however, did not merely root in the implementation of FP programs. In other words, families’ strong...
متن کاملInterval Scheduling
Scheduling problems are formulated in terms of machines and jobs. The machines represent resources and the jobs represent tasks that have to be carried out using these resources. In a traditional scheduling problem there is freedom in determining the starting times of the jobs. The scheduler uses this freedom by attempting to construct a schedule that satisfies certain constraints or even one t...
متن کاملDigitizing Interval Duration Logic
Interval Duration Logic, (IDL), is a dense time logic for specifying properties of real-time systems. Its validity is undecidable. A corresponding discrete-time logic QDDC has decidable validity. In this paper, we consider a reduction of IDL validity question to QDDC validity using notions of digitization. A new notion of Strong Closure under Inverse Digitization, SCID, is proposed. It is shown...
متن کاملA comparative evaluation of modeling approaches to the labor shift scheduling problem
The labor shift scheduling problem has traditionally been formulated using the set covering approach proposed by Dantzig, G.B. [1954. Operations Research 2 (3), 339±341]. The size of the resulting integer model with this approach, however, has been found to be very large to solve optimally in most practical applications. Recently, Bechtold, S.E., Jacobs, L.W. [1990. Management Science 36 (11), ...
متن کاملScheduling interval orders in parallel
Interval orders are partial orders defined by having interval representations. It is well known that a transitively oriented digraph G is an interval order iff its (undirected) complement G is chordal. We investigate parallel algorithms for the following scheduling problem: Given a system consisting of a set T of n tasks (each requiring unit execution time) and an interval order 4 over I, and g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cornell Hotel and Restaurant Administration Quarterly
سال: 2004
ISSN: 0010-8804
DOI: 10.1177/0010880403260111